Contributions to a theory of existentialtermination for de nite logic
نویسندگان
چکیده
We suggest a new formalization of the existential termination problem of logic programs under the PROLOG leftmost selection rule and depth-rst computation rule. First of all, we give a characterization of the problem in terms of occurrence sets, by proving that a hprogram; goali existentially terminates if and only if there exists a nite correct occurrence set. Then we show that in order to study existential termination, we do not need to specify the occurrences of the atoms, since existential termination turns out to be decidable, when instances of atoms are used more than once (up to renaming). We then reduce the veriication of existential termination to the search of a suitable semi occurrence set for the pair hprogram; goali, by providing an algorithm for proving that the proposed semi occurrence set is a correct occurrence set. Finally we propose a simple method (based on abstract interpretation techniques) for generating such semi occurrence sets.
منابع مشابه
On the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملContributions à la sémantique de la programmation logique
This work can be split in two parts. First, we present a full formalisation of the semantics of de nite programs, in the calculus of inductive constructions. For this, we describe a formalisation of the proof of rst order terms uni cation obtained from a similar proof dealing with quasi-terms, thus showing in a general setting how partial functions can be considered in a system with total funct...
متن کاملFuzzy logic controlled differential evolution to solve economic load dispatch problems
In recent years, soft computing methods have generated a large research interest. The synthesis of the fuzzy logic and the evolutionary algorithms is one of these methods. A particular evolutionary algorithm (EA) is differential evolution (DE). As for any EA, DE algorithm also requires parameters tuning to achieve desirable performance. In this paper tuning the perturbation factor vector of DE ...
متن کاملFuzzy logic controlled differential evolution to solve economic load dispatch problems
In recent years, soft computing methods have generated a large research interest. The synthesis of the fuzzy logic and the evolutionary algorithms is one of these methods. A particular evolutionary algorithm (EA) is differential evolution (DE). As for any EA, DE algorithm also requires parameters tuning to achieve desirable performance. In this paper tuning the perturbation factor vector of DE ...
متن کامل